Distributed decoding of rectangular parity-check code
نویسندگان
چکیده
Introduction: The goal of this Letter is to investigate the possibility of achieving spatial diversity without the use of physically connected antenna arrays by examining the simple case of a two-node network. We consider a pair of nodes that are connected via a communication channel that has relatively benign characteristics. Typically, these two nodes are in close proximity. For simplicity, we assume that the two nodes can communicate with each other reliably. A distant transmitter sends a packet of coded data bits to the two receiving nodes. We assume that the coded bits from the transmitter are modulated using binary phase-shift keying (BPSK). After matched-filtering and proper normalization, the decision statistics for the ith coded bit obtained at the two receiving nodes are:
منابع مشابه
Reduced-complexity decoding for concatenated codes based on rectangular parity-check codes and turbo codes
In this paper, we compare the performance of several different decoding strategies for concatenated codes based on a serial concatenation of a rectangular parity-check code (RPCC) with a turbo code. These concatenated codes are referred to as RPCC+turbo codes. RPCC+turbo codes have been shown to significantly outperform turbo codes in several scenarios [1],[2]. One particularly useful applicati...
متن کاملModified Algorithm on Maximum Detected Bit Flipping Decoding for High Dimensional Parity-Check Code
SUMMARY We have researched high dimensional parity-check (HDPC) codes that give good performance over a channel that has a very high error rate. HDPC code has a little coding overhead because of its simple structure. It has hard-in, maximum detected bit flipping (MDBF) decoding that has reasonable decoding performance and computational cost. In this paper, we propose a modified algorithm for MD...
متن کاملAdaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
We describe an operation to dynamically adapt the structure of the Tanner graph used during iterative decoding. Codes on graphs– most importantly, low-density parity-check (LDPC) codes–exploit randomness in the structure of the code. Our approach is to introduce a similar degree of controlled randomness into the operation of the messagepassing decoder, to improve the performance of iterative de...
متن کاملLow-density parity-check codes
A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column contains a small fixed numberj > 3 of I’s and each row contains a small fixed number k > j of 1’s. The typical minimum distance of these codes increases linearly with block length for a fixed rate and fixed j. When used with maximum likelihood decoding on a snfhciently quiet ...
متن کاملHard Decision and Soft Decision Decoding Algorithms for Ldpc and Qc-ldpc Codes
In this paper Hard Decision and Soft Decision decoding techniques for Quasi-Cyclic-Low Density Parity Check (QC-LDPC) code and Low Density Parity Check (LDPC) code is introduced. QC-LDPC code is proposed to reduce the complexity of the Low Density Parity Check code while obtaining the similar performance. The decoding processes of these codes are easy to simplify and implement. The algorithms u...
متن کاملA Decoding Method of Low-Density Parity-Check Codes Over the Binary Erasure Channel
We propose a new decoding algorithm of LDPC codes over the binary erasure channel (BEC). The proposed decoding algorithm is an iterative one which uses the sparseness structure of the parity-check matrix of LDPC codes. We show by simulation results that the proposed decoding algorithm and the conventional decoding algorithm have a trade-off between remaining erasure rate and complexity. Keyword...
متن کامل